Curry–Howard correspondence - PDFSEARCH.IO - Document Search Engine

Curry–Howard correspondence
Results: 226

#	Item
51	Parallel Belief Revision: Revising by Sets of Formulas James Delgrande and Yi Jin School of Computing Science Simon Fraser University Burnaby, B.C. V5A 1S6 Add to Reading List Source URL: www.cs.sfu.ca Language: English - Date: 2012-08-16 12:35:55 Logic Logic programming Constructible universe Mathematics Ordinal numbers Set theory Curry–Howard correspondence Ordinal arithmetic Mathematical logic Belief revision Knowledge representation
52	Propositions as [Types] Steve Awodey∗ Andrej Bauer† Institut Mittag-Leffler Add to Reading List Source URL: andrej.com Language: English - Date: 2010-06-11 17:17:44 Proof theory Deduction Algebraic topology Curry–Howard correspondence Philosophy of computer science Type theory Entailment Sheaf Natural deduction Logic Abstract algebra Mathematics
53	Finding Endogenously Formed Communities Maria-Florina Balcan∗ Christian Borgs† Mark Braverman Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-10-03 18:58:33 Logical consequence Logical syntax Metalogic Ordinal arithmetic Curry–Howard correspondence Logic Deduction Entailment
54	A Framework for Defining Logics Robert Harper∗ Furio Honsell† Gordon Plotkin‡ Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2004-06-30 10:44:06 Logic in computer science Proof theory Dependently typed programming Type theory Deduction Natural deduction Curry–Howard correspondence Logical framework Symbol Logic Mathematics Mathematical logic
55	Equational Reasoning about Programs with General Recursion and Call-by-value Semantics Garrin Kimmell Aaron Stump Add to Reading List Source URL: www.seas.upenn.edu Language: English - Date: 2014-07-10 05:47:16 Logic in computer science Mathematical logic Type theory Dependently typed programming Higher-order functions Append Curry–Howard correspondence Curry Structural induction Software engineering Computing Computer programming
56	On Typability for Rank-2 Intersection Types with Polymorphic Recursion ∗ Tachio Terauchi EECS Department University of California, Berkeley Abstract Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2006-05-22 01:29:30 Computer science Philosophy of mathematics Orbifold Ordinal arithmetic Symbol Curry–Howard correspondence Mathematics
57	Combining Proofs and Programs in a Dependently Typed Language Chris Casinghino Vilhelm Sjöberg Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2014-07-10 05:47:21 Logic in computer science Lambda calculus Proof theory Deduction Models of computation Curry–Howard correspondence Entailment Combinatory logic Fixed-point combinator Theoretical computer science Logic Mathematics
58	Type Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems Koji Nakazawa∗ Makoto Tatsuta† Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-03 17:31:32 Mathematics Proof theory Lambda calculus Type theory Natural deduction Symbol Entailment System F Curry–Howard correspondence Logic Mathematical logic Deduction
59	Type Theory & Functional Programming Simon Thompson Computing Laboratory, University of Kent March 1999 Add to Reading List Source URL: www.cs.kent.ac.uk Language: English - Date: 2012-11-02 09:24:49 Theoretical computer science Logic in computer science Lambda calculus Proof theory Dependently typed programming Curry–Howard correspondence Intuitionistic type theory Combinatory logic Natural deduction Mathematics Mathematical logic Type theory
60	On the Complexity of Deciding Sense of Direction∗ Paolo Boldi† Sebastiano Vigna† Abstract Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:50:05 Functions and mappings Nonassociative algebra Group theory Combinatory logic Lambda calculus Constructible universe Curry–Howard correspondence Function Quasigroup Mathematics Abstract algebra Logic in computer science